Approximated Perspective Relaxations: a Project&Lift Approach
نویسندگان
چکیده
The Perspective Reformulation (PR) of a Mixed-Integer NonLinear Program with semicontinuous variables is obtained by replacing each term in the (separable) objective function with its convex envelope. Solving the corresponding continuous relaxation requires appropriate techniques. Under some rather restrictive assumptions, the Projected PR (PR) can be defined where the integer variables are eliminated by projecting the solution set onto the space of the continuous variables only. This approach produces a simple piecewise-convex problem with the same structure as the original one; however, this prevents the use of general-purpose solvers, in that some variables are then only implicitly represented in the formulation. We show how to construct an Approximated Projected PR (APR) whereby the projected formulation is “lifted” back to the original variable space, with each integer variable expressing one piece of the obtained piecewise-convex function. In some cases, this produces a reformulation of the original problem with exactly the same size and structure as the standard continuous relaxation, but providing substantially improved bounds. In the process we also substantially extend the approach beyond the original PR development by relaxing the requirement that the objective function be quadratic and the left endpoint of the domain of the variables be non-negative. While the APR bound can be weaker than that of the PR, this approach can be applied in many more cases and allows direct use of off-the-shelf MINLP software; this is shown to be competitive with previously proposed approaches in some applications.
منابع مشابه
A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization
In both mathematical research and real-life, we often encounter problems that can be framed as finding the best solution among a collection of discrete choices. Many of these problems, on which an exhaustive search in the solution space is impractical or even infeasible, belong to the area of combinatorial optimization, a lively branch of discrete mathematics that has seen tremendous developmen...
متن کاملSolving Lift-and-Project Relaxations of Binary Integer Programs
We propose a method for optimizing the lift-and-project relaxations of binary integer programs introduced by Lovász and Schrijver. In particular, we study both linear and semidefinite relaxations. The key idea is a restructuring of the relaxations, which isolates the complicating constraints and allows for a Lagrangian approach. We detail an enhanced subgradient method and discuss its efficient...
متن کاملA Comprehensive Analysis of Polyhedral Lift-and-Project Methods
We consider lift-and-project methods for combinatorial optimization problems and focus mostly on those lift-and-project methods which generate polyhedral relaxations of the convex hull of integer solutions. We introduce many new variants of Sherali–Adams and Bienstock– Zuckerberg operators. These new operators fill the spectrum of polyhedral lift-and-project operators in a way which makes all o...
متن کاملTighter Linear and Semidefinite Relaxations for Max-cut Based on the Lovász–schrijver Lift-and-project Procedure∗
We study how the lift-and-project method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5-minor. Therefore, for a graph G with n ≥ 4 nodes with stability number α(G), n − 4 iterations suffice instead of ...
متن کاملUnderstanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set Cover problem with approximation ratios better than lnn. In light of this result, it is natural to ask whether such improvements can be achieved using lift-andproject methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algo...
متن کامل